A Numerical Study of Some Parallel Algebraic Preconditioners
نویسندگان
چکیده
We present a numerical study of several parallel algebraic preconditioners, which speed up the convergence of Krylov iterative methods when solving large-scale linear systems. The studied algebraic preconditioners are of two types. The first type includes simple block preconditioners using incomplete factorizations or preconditioned Krylov solvers on the subdomains. The second type is an enhancement of the first type in that Schur complement techniques are added to treat subdomain-interface unknowns. The numerical experiments show that the scalability properties of the preconditioners are highly problem dependent, and a simple Schur complement technique is favorable for achieving good overall efficiency.
منابع مشابه
Parallel algebraic multilevel Schwarz preconditioners for a class of elliptic PDE systems
Algebraic multilevel preconditioners for algebraic problems arising from the discretization of a class of systems of coupled elliptic partial differential equations (PDEs) are presented. These preconditioners are based on modifications of Schwarz methods and of the smoothed aggregation technique, where the coarsening strategy and the restriction and prolongation operators are defined using a po...
متن کاملParallel algebraic multilevel Schwarz preconditioners for elliptic PDE systems∗
Algebraic multilevel preconditioners for linear systems arising from the discretization of a class of systems of coupled elliptic partial differential equations (PDEs) are presented. These preconditioners are based on modifications of Schwarz methods and of the smoothed aggregation technique, where the coarsening strategy and the restriction and prolongation operators are defined using a point-...
متن کاملParallel Triangular Solvers on GPU
In this paper, we investigate GPU based parallel triangular solvers systematically. The parallel triangular solvers are fundamental to incomplete LU factorization family preconditioners and algebraic multigrid solvers. We develop a new matrix format suitable for GPU devices. Parallel lower triangular solvers and upper triangular solvers are developed for this new data structure. With these solv...
متن کاملCombining Multilevel Preconditioners with Domain Decomposition for Solving Linear Systems
Algebraic multilevel techniques for defining preconditioners have proven to bevery effective when used with Krylov methods. In most cases, they can solvelinear systems arising from the dicretization of PDEs with a number of floatingpoint operations proportional to the number of unknowns. To be efficient onparallel computers these multilevel techniques must use parallel smoothers...
متن کاملSome Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...
متن کامل